Decision-Theoretic, High-Level Agent Programming in the Situation Calculus
نویسندگان
چکیده
We propose a framework for robot programming which allows the seamless integration of explicit agent programming with decision-theoretic planning. Specifically, the DTGolog model allows one to partially specify a control program in a highlevel, logical language, but also provides an interpreter that— given a logical axiomatization of a domain—will determine the optimal completion of that program (viewed as a Markov decision process). We demonstrate the utility of this model by describing results obtained in an office delivery robotics domain.
منابع مشابه
Decision Making in Uncertain Real-World Domains
DTGolog, a decision-theoretic agent programming language based on the situation calculus, was proposed to ease some of the computational difficulties associated with Markov Decision Processes (MDPs) by using natural ordering constraints on execution of actions. Using DTGolog, domain specific constraints on a set of policies can be expressed in a high-level program to reduce significantly comput...
متن کاملCompiling Qualitative Preferences into Decision-Theoretic Golog Programs
Personalization is becoming increasingly important in agent programming, particularly as it relates to the Web. We propose to develop underspecified, task-specific agent programs, and to automatically personalize them to the preferences of individual users. To this end, we propose a framework for agent programming that integrates rich, non-Markovian, qualitative user preferences with quantitati...
متن کاملDecision-Theoretic GOLOG with Qualitative Preferences
Personalization is becoming increasingly important in agent programming, particularly as it relates to the Web. We propose to develop underspecified, task-specific agent programs, and to automatically personalize them to the preferences of individual users. To this end, we propose a framework for agent programming that integrates rich, nonMarkovian, qualitative user preferences expressed in a l...
متن کاملRepairing Decision-Theoretic Policies Using Goal-Oriented Planning
In this paper we address the problem of how decision-theoretic policies can be repaired. This work is motivated by observations made in robotic soccer where decision-theoretic policies become invalid due to small deviations during execution; and repairing might pay off compared to re-planning from scratch. Our policies are generated with Readylog, a derivative of Golog based on the situation ca...
متن کاملA General-Purpose Probabilistic Language
1.1 Introduction In a rational programming language, a program specifes a situation encountered by an agent; evaluating the program amounts to computing what a rational agent would believe or do in the situation. Rational programming combines the advantages of declarative representations with features of programming languages such as modularity, compositionality, and type systems. A system desi...
متن کامل